package problems;

public class Problem26 {
	private static final int TARGET = 1000;

	public static void main(String[] args) {
		int d = 3;
		int maxLength = 1;
		for (int i = 5; i <= TARGET; i+=2) {
			int length = cycleLength(1d/i);
			if (length > maxLength) {
				d = i;
				maxLength = length;
			}
		}
		System.out.printf("%d has longest cycle length (%d): %.50f", d, maxLength, 1d/d);
	}

	private static int cycleLength(Double d) {
		//TODO implement
		return 1;
	}
	
}
